00_welcome_page
01_graph_basics
02_why_traverse_graphs
03_the_traversal_problem
04_bfs_core_idea
05_queue_refresher
06_bfs_minimal_pseudocode
07_bfs_walkthrough_setup
08_bfs_trace_the_queue
09_bfs_levels_and_parents
10_bfs_python_template
11_unweighted_shortest_path
12_edge_cases_pitfalls
13_bfs_worked_code_example
14_bfs_complexity_memory
15_when_to_choose_bfs
16_transition_to_depth
17_dfs_core_idea
18_recursion_stack_refresher
19_dfs_recursive_pseudocode
20_dfs_iterative_with_stack
21_dfs_trace_the_call_stack
22_why_dfs_tree_matters
23_dfs_tree
24_dfs_discovery_finish_times
25_dfs_cycle_detection_undirected
26_dfs_cycle_detection_code_undirected
27_dfs_on_dag
28_topological_sort_via_dfs
29_bfs_vs_dfs_comparison
30_dfs_complexity_memory
31_full_dfs_python_recursive
32_choosing_bfs_vs_dfs
33_implementation_templates
34_common_mistakes_debugging
35_mini_assessment
36_glossary_and_symbols
37_summary_and_whats_next
> Terminal ready. Click 'Run Code' to execute your code.
Your Personal AI Tutor
Ask me anything! Here are some ideas to get started:
Understand Concepts
Ask me to explain the current slide or a concept in simple terms.
Generate Code
Request code examples in different programming languages.
Use Your Tone and Language
Ask in different languages or tones and I'll adapt.
The AI assistant can make mistakes, verify important info.